A robust and conservative dynamical low-rank algorithm
نویسندگان
چکیده
Dynamical low-rank approximation, as has been demonstrated recently, can be extremely efficient in solving kinetic equations. However, a major deficiency is that they do not preserve the structure of underlying physical problem. For example, classic dynamical methods violate mass, momentum, and energy conservation. In [L. Einkemmer, I. Joseph, J. Comput. Phys. 443:110495, 2021] conservative approach proposed. directly integrating resulting equations motion, similar to approach, results an ill-posed scheme. this work we propose robust, i.e. well-posed, integrator for conserves mass momentum (up machine precision) significantly improves We also report improved qualitative some problems show how combined with rank adaptive
منابع مشابه
A Robust Visual Tracking Algorithm with Low-Rank Region Covariance
Region covariance (RC) descriptor is an effective and efficient feature for visual tracking. Current RC-based tracking algorithms use the whole RC matrix to track the target in video directly. However, there exist some issues for these whole RCbased algorithms. If some features are contaminated, the whole RC will become unreliable, which results in lost object-tracking. In addition, if some fea...
متن کاملDynamical low-rank approximation
In low-rank approximation, separation of variables is used to reduce the amount of data in computations with high-dimensional functions. Such techniques have proved their value, e.g., in quantum mechanics and recommendation algorithms. It is also possible to fold a low-dimensional grid into a high-dimensional object, and use low-rank techniques to compress the data. Here, we consider low-rank t...
متن کاملDynamical Low-Rank Approximation
For the low rank approximation of time-dependent data matrices and of solutions to matrix differential equations, an increment-based computational approach is proposed and analyzed. In this method, the derivative is projected onto the tangent space of the manifold of rank-r matrices at the current approximation. With an appropriate decomposition of rank-r matrices and their tangent matrices, th...
متن کاملLearning Robust Low-Rank Representations
In this paper we present a comprehensive framework for learning robust low-rank representations by combining and extending recent ideas for learning fast sparse coding regressors with structured non-convex optimization techniques. This approach connects robust principal component analysis (RPCA) with dictionary learning techniques and allows its approximation via trainable encoders. We propose ...
متن کاملA dynamical low-rank approach to the chemical master equation.
Stochastic reaction kinetics have increasingly been used to study cellular systems, with applications ranging from viral replication to gene regulatory networks and to signaling pathways. The underlying evolution equation, known as the chemical master equation (CME), can rarely be solved with traditional methods due to the huge number of degrees of freedom. We present a new approach to directly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2023
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2023.112060